Quantitative information flow as network flow capacity
نویسندگان
چکیده
منابع مشابه
Quantitative Information Flow Metrics
Information flow analysis is a powerful technique for reasoning about sensitive information that may be exposed during program execution. One promising approach is to adopt a program as a communication channel model and leverage information theoretic metrics (e.g., mutual information between the sensitive input and the public output) to quantify such information flows. However, recent research ...
متن کاملNetwork information flow
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. Thi...
متن کاملNetwork Information Flow
A formal model for an analysis of an information flow in interconnection networks is presented. It is based on timed process algebra which can express also network properties. The information flow is based on a concept of deducibility on composition. Robustness of systems against network timing attacks is defined. A variety of different security properties which reflect different security requi...
متن کاملWireless Network Information Flow
We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set bound is a product distribution, then we have a complete characterization of the achievable rates for such networks. For linear deterministic finite-field m...
متن کاملAlgebra for Quantitative Information Flow
A core property of program semantics is that local reasoning about program fragments remains sound even when the fragments are executed within a larger system. Mathematically this property corresponds to monotonicity of refinement : if A refines B then C(A) refines C(B) for any (valid) context defined by C(·). In other work we have studied a refines order for information flow in programs where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2008
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1379022.1375606